Job shop scheduling considering material handling process
نویسندگان
چکیده
منابع مشابه
Handling Uncertainty in Job-Shop Scheduling
We discuss our proposed approach to handling uncertainty and constraints in job-shop scheduling. Specifically we deal with uncertainty in the duration of a task, as well as constraints on task completion time, task separation, etc. We discuss both offline and adaptive scheduling strategies. Our approach is to synthesize fast schedulers that handle uncertainty by calculating them from formal spe...
متن کاملJob-shop scheduling
The n×m minimum-makespan general job-shop scheduling problem, hereafter referred to as the JSSP, can be described by a set of n jobs {Ji}1≤j≤n which is to be processed on a set of m machines {Mr}1≤r≤m. Each job has a technological sequence of machines to be processed. The processing of job Jj on machine Mr is called the operation Ojr. Operation Ojr requires the exclusive use of Mr for an uninte...
متن کاملHybrid job shop scheduling
We consider the problem of scheduling jobs in a hybrid job shop We use the term hybrid to indicate that we consider a lot of extensions of the classic job shop such as transportation times multiple resources and setup times The Shifting Bottleneck procedure can be generalized to deal with those extensions We test this approach for an assembly shop In this shop we study the in uence of static an...
متن کاملJob-shop scheduling in a body shop
We study a generalized job-shop problem called the body shop scheduling problem (BSSP). This problem arises from the industrial application of welding in a car body production line, where possible collisions between industrial robots have to be taken into account. BSSP corresponds to a job-shop problem where the operations of a job have to follow alternating routes on the machines, certain oper...
متن کاملFlexible Job-Shop Scheduling Problems
Planning and scheduling problems in various industrial environments are combinatorial and very difficult. Generally, it is extremely hard to solve these types of problems in their general form. Scheduling can be formulated as a problem of determining the best sequence to execute a set of tasks on a set of resources, respecting specific constraints like precedence or disjunctive constraints (Car...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2018
ISSN: 2261-236X
DOI: 10.1051/matecconf/201820407008